Preliminary instability-analysis of deepwater riser with fairings

Instability of deepwater riser with fairings is investigated in this study. Despite the advantages over other devices for suppressing vortex-induced-vibration (VIV), fairings may be susceptible to flutter type instability. A two-body mathematical model is established for the coupled transverse-torsion motion of a top tensioned riser with fairings. The inner part (riser) can only move transversely while the outer part (fairing) has transverse-torsion motion. The effect of the transverse velocity on the angle of attack is taken into account and damping is considered for both degrees of freedom. An eigenvalue analysis is employed to examine the issue of stability. The emphasis is on identifying the critical current speed for a given riser and fairing configuration. The effects of key parameters are investigated and the results indicate that the section hydrodynamic characteristics of the fairings have a significant impact on the instability

Un modelo para resolver el problema dinámico de despacho de vehículos con incertidumbre de clientes y con tiempos de viaje en arcos

Indexación: Web of Science; ScieloIn a real world case scenario, customer demands are requested at any time of the day requiring services that are not known in advance such as delivery or repairing equipment. This is called Dynamic Vehicle Routing (DVR) with customer uncertainty environment. The link travel time for the roadway network varies with time as traffic fluctuates adding an additional component to the dynamic environment. This paper presents a model for solving the DVR problem while combining these two dynamic aspects (customer uncertainty and link travel time). The proposed model employs Greedy, Insertion, and Ant Colony Optimization algorithms. The Greedy algorithm is utilized for constructing new routes with existing customers, and the remaining two algorithms are employed for rerouting as new customer demands appear. A real world application is presented to simulate vehicle routing in a dynamic environment for the city of Taipei, Taiwan. The simulation shows that the model can successfully plan vehicle routes to satisfy all customer demands and help managers in the decision making process.En un escenario real, los pedidos de los clientes son solicitados a cualquier hora del día requiriendo servicios que no han sido planificados con antelación tales como los despachos o la reparación de equipos. Esto es llamado ruteo dinámico de vehículos (RDV) considerando un ambiente con incertidumbre de clientes. El tiempo de viaje en una red vial varía con el tiempo a medida que el tráfico vehicular fluctúa agregando una componente adicional al ambiente dinámico. Este artículo propone un modelo para resolver el problema RDV combinando estos dos aspectos dinámicos. El modelo propuesto utiliza los algoritmos Greedy, Inserción y optimización basada en colonias de hormigas. El algoritmo Greedy es utilizado para construir nuevas rutas con los clientes existentes y los otros dos algoritmos son usados para rutear vehículos a medida que surjan nuevos clientes con sus respectivos pedidos. Además, se presenta una aplicación real para simular el ruteo vehicular en un ambiente dinámico para la ciudad de Taipei, Taiwán. Esta simulación muestra que el modelo es capaz de planificar exitosamente las rutas vehiculares satisfaciendo los pedidos de los clientes y de ayudar los gerentes en el proceso de toma de decisiones.http://ref.scielo.org/3ryfh

Structural abstraction: a mechanism for modular program construction

Abstraction mechanisms in programming languages aim to allow orthogonal pieces of functionality to be developed separately; complex software can then be constructed through the composition of these pieces. The effectiveness of such mechanisms lies in their support for modularity and reusability: The behavior of a piece of code should be reasoned about modularly---independently of the specific compositions it may participate in; the computation of a piece of code should allow specialization, so that it is reusable for different compositions. This dissertation introduces structural abstraction: a mechanism that advances the state of the art by allowing the writing of highly reusable code---code whose structure can be specialized per composition, while maintaining a high level of modularity. Structural abstraction provides a disciplined way for code to inspect the structure of its clients in composition, and declare its own structure accordingly. The hallmark feature of structural abstraction is that, despite its emphasis on greater reusability, it still allows modular type checking: A piece of structurally abstract code can be type-checked independently of its uses in compositions---an invaluable feature for highly reusable components that will be statically composed by other programmers. This dissertation introduces two structural abstraction techniques: static type conditions, and morphing. Static type conditions allow code to be conditionally declared based on subtyping constraints. A client of a piece of code can configure a desirable set of features by composing the code with types that satisfy the appropriate subtyping conditions. Morphing allows code to be iteratively declared, by statically reflecting over the structural members of code that it would be composed with. A morphing piece of code can mimic the structure of its clients in composition, or change its shape according to its clients in a pattern-based manner. Using either static type conditions or morphing, the structure of a piece of code is not statically determined, but can be automatically specialized by clients. Static type conditions and morphing both guarantee the modular type-safety of code: regardless of specific client configurations, code is guaranteed to be well-typed.Ph.D.Committee Chair: Yannis Smaragdakis; Committee Member: Oege de Moor; Committee Member: Richard LeBlanc; Committee Member: Santosh Pande; Committee Member: Spencer Rugabe

Possible quantum phase-manipulation of a two-leg ladder in mixed-dimensional fermionic cold atoms

The recent realization of mixed-dimensional systems of cold atoms has attracted much attention from both experimentalists and theorists. Different effective interactions and novel correlated quantum many-body phases may be engineered in these systems, with the different phases being tunable via external parameters. In this article we investigate a two-species Fermi atom mixture: one species of atom exists in two hyperfine states and is confined to move in a two-leg ladder, interacting with an on-site interaction, and the other moves freely in a two dimensional square lattice that contains the two-leg ladder. The two species of atoms interact via an on-site interaction on the ladder. In the limit of weak inter-species interactions, the two-dimensional gas can be integrated out, leading to an effective long-range mediated interaction in the ladder, generated by to the on-site inter-species interaction. We show that the form of the mediated interaction can be controlled by the density of the two-dimensional gas and that it enhances the charge density wave instability in the two-leg ladder after the renormalization group transformation. Parameterizing the phase diagram with various experimentally controllable quantities, we discuss the possible tuning of the macroscopic quantum many-body phases of the two-leg ladder in this mixed-dimensional fermionic cold atom system.Comment: 4 pages and 3 figure

Binomial Difference Ideal and Toric Difference Variety

In this paper, the concepts of binomial difference ideals and toric difference varieties are defined and their properties are proved. Two canonical representations for Laurent binomial difference ideals are given using the reduced Groebner basis of Z[x]-lattices and regular and coherent difference ascending chains, respectively. Criteria for a Laurent binomial difference ideal to be reflexive, prime, well-mixed, perfect, and toric are given in terms of their support lattices which are Z[x]-lattices. The reflexive, well-mixed, and perfect closures of a Laurent binomial difference ideal are shown to be binomial. Four equivalent definitions for toric difference varieties are presented. Finally, algorithms are given to check whether a given Laurent binomial difference ideal I is reflexive, prime, well-mixed, perfect, or toric, and in the negative case, to compute the reflexive, well-mixed, and perfect closures of I. An algorithm is given to decompose a finitely generated perfect binomial difference ideal as the intersection of reflexive prime binomial difference ideals.Comment: 72 page